package bjtuoj;

import java.util.Arrays;
import java.util.Scanner;

/**
 * ClassName: Homework_1_E
 * Description:
 * date: 2021-09-25 21:37
 *
 * @author liyifan
 */
public class Homework_1_E {

    public static int maxn = 100 + 10;

    public static int[] dp = new int[20010];

    public static int[] ans = new int[maxn];

    public static int[] cap = new int[maxn];

    public static int max_d;

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int q = scanner.nextInt();
        int p = scanner.nextInt();
        for(int i = 0;i < cap.length;i++) {
            cap[i] = scanner.nextInt();
        }
        scanner.close();
        Arrays.sort(cap);
        for (max_d = 1; max_d <= p; max_d++) {
            dfs(0, 0);
        }
    }

    public static void dfs(int current, int depth) {

    }
}
